#include "BinarySearch.h"
#include <vector>



int main()
{
	srand(0);
	int N = 10;
	int arr[10];
	BinarySearchTree<int> t;
	for (int i = 0; i < N; i++)
	{
		arr[i] = rand();
		t.Insert(arr[i]);
		t.inorder();
		cout << endl;
	}

	cout << "------------------------------------------------------" << endl;
	for (int i = 0; i < N; i++)
	{
		t.EraseR(arr[i]);
		t.inorder();
		cout << endl;
	}

	
	return 0;
}

